Codes for Deletion and Insertion Channels With Segmented Errors

Marker Codes for Channels with Insertion, Deletion and Substitution Errors

...................................................................................................................... 3

Insertion and Deletion for Involution Codes

This paper introduces a generalization of the operation of catenation: u[k]lv, the left-k-insertion, is the set of all words obtained by inserting v into u in positions that are at most k letters away from the left extremity of the word u. We define k-suffix codes using the left-kinsertion operation and extend the concept of k-prefix and k-suffix codes to involution k-prefix and involution k-su...

Iterative Decoding for Bit-Patterned Media Recording Channels with Insertion/Deletion Errors

In bit-patterned media recording (BPMR) systems, the degraded system performance is often caused not only by the intertrack interference (ITI) and the intersymbol interference (ISI), but also by insertion/deletion errors. This insertion/deletion error is one of the major problems in BPMR systems. Therefore, we propose an iterative decoding scheme for a BPMR system to combat the insertion/deleti...

Optimal codes in deletion and insertion metric

We improve the upper bound of Levenshtein for the cardinality of a code of length 4 capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we will construct an optimal perfect code capable of correcting single deletions for the same parameters.

Capa ity of Insertion and Deletion Channels